ID Bloom Filter: Achieving Faster Multi-Set Membership Query in Network Applications

The problem of multi-set membership query plays a significant role in many network applications, including routers and firewalls. Answering multi-set membership query means telling whether an element belongs to the multi-set, and if yes, which particular set it belongs to. Most traditional solutions for multi-set membership query are based on Bloom filters. However, these solutions cannot achieve high accuracy and high speed at the same time when the memory is tight. To address this issue, this paper presents the ID Bloom Filter (IBF) and ID Bloom Filter with ones’ Complement (IBFC). The key technique in IBF is mapping each element to k positions in a filter and directly recording its set ID at these positions. It has a small memory usage as well as a high processing speed. To achieve higher accuracy, we propose IBFC that records the set ID and its ones’ complement together. The experimental results show that our IBF and IBFC are faster than the state-of-the-art while achieving a high accuracy.